"Turing tape" meaning in English

See Turing tape in All languages combined, or Wiktionary

Noun

Forms: Turing tapes [plural]
Head templates: {{en-noun|~}} Turing tape (countable and uncountable, plural Turing tapes)
  1. (computing theory) The infinitely long memory tape on which a Turing machine would operate, consisting of individual cells that can be read or written. Tags: countable, uncountable Categories (topical): Theory of computing

Inflected forms

{
  "forms": [
    {
      "form": "Turing tapes",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "Turing tape (countable and uncountable, plural Turing tapes)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "The infinitely long memory tape on which a Turing machine would operate, consisting of individual cells that can be read or written."
      ],
      "id": "en-Turing_tape-en-noun-VDOXzhuo",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "infinitely",
          "infinitely"
        ],
        [
          "memory",
          "memory"
        ],
        [
          "tape",
          "tape"
        ],
        [
          "Turing machine",
          "Turing machine"
        ],
        [
          "operate",
          "operate"
        ],
        [
          "consisting",
          "consisting"
        ],
        [
          "individual",
          "individual"
        ],
        [
          "cell",
          "cell"
        ],
        [
          "read",
          "read"
        ],
        [
          "written",
          "write"
        ]
      ],
      "raw_glosses": [
        "(computing theory) The infinitely long memory tape on which a Turing machine would operate, consisting of individual cells that can be read or written."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Turing tape"
}
{
  "forms": [
    {
      "form": "Turing tapes",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "Turing tape (countable and uncountable, plural Turing tapes)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "The infinitely long memory tape on which a Turing machine would operate, consisting of individual cells that can be read or written."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "infinitely",
          "infinitely"
        ],
        [
          "memory",
          "memory"
        ],
        [
          "tape",
          "tape"
        ],
        [
          "Turing machine",
          "Turing machine"
        ],
        [
          "operate",
          "operate"
        ],
        [
          "consisting",
          "consisting"
        ],
        [
          "individual",
          "individual"
        ],
        [
          "cell",
          "cell"
        ],
        [
          "read",
          "read"
        ],
        [
          "written",
          "write"
        ]
      ],
      "raw_glosses": [
        "(computing theory) The infinitely long memory tape on which a Turing machine would operate, consisting of individual cells that can be read or written."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Turing tape"
}

Download raw JSONL data for Turing tape meaning in English (1.3kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-01-13 from the enwiktionary dump dated 2025-01-01 using wiktextract (4ba5975 and 4ed51a5). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.